The Smallest Possible Interaction Radius for Flock Synchronization
نویسندگان
چکیده
This paper investigates the synchronization behavior of a class of flocks modeled by the nearest neighbor rules. While connectivity of the associated dynamical neighbor graphs is crucial for synchronization, it is well known that the verification of such dynamical connectivity is the core of theoretical analysis. Ideally, conditions used for synchronization should be imposed on the model parameters and the initial states of the agents. One crucial model parameter is the interaction radius, and we are interested in the following natural but complicated question: What is the smallest interaction radius for synchronization of flocks? In this paper, we reveal that, in a certain sense, the smallest possible interaction radius approximately equals √ logn/(πn), with n being the population size, which coincides with the critical radius for connectivity of random geometric graphs given by Gupta and Kumar [Critical power for asymptotic connectivity in wireless networks, in Stochastic Analysis, Control, Optimization and Applications, Birkhäuser Boston, Boston, MA, 1999, pp. 547– 566].
منابع مشابه
The Smallest Possible Interaction Radius for Synchronization of Self-Propelled Particles
A central and fundamental issue in the theory of complex systems is to understand how local rules lead to collective behavior of the whole system. This paper will investigate a typical collective behavior (synchronization) of a self-propelled particle system modeled by the nearest neighbor rules. While connectivity of the dynamic neighbor graphs associated with the underlying systems is crucial...
متن کاملRobust Synchronization of Linear Multi-agent Systems with Additive Uncertainty
EXTENDED ABSTRACT. In this paper we will deal with the problem of robust synchronization of uncertain multi-agent networks. Given a network with for each of the agents identical nominal linear dynamics, we allow uncertainty in the form of additive perturbations of the transfer matrices of the nominal dynamics. The perturbations are assumed to be stable and bounded in H∞-norm by some a priori gi...
متن کاملFluctuation-Driven Flocking Movement in Three Dimensions and Scale-Free Correlation
Recent advances in the study of flocking behavior have permitted more sophisticated analyses than previously possible. The concepts of "topological distances" and "scale-free correlations" are important developments that have contributed to this improvement. These concepts require us to reconsider the notion of a neighborhood when applied to theoretical models. Previous work has assumed that in...
متن کاملEfficient Mining of Closed Flock Patterns from Large Trajectory Data
In this paper, we study the closed pattern mining problem for a class of spatio-temporal patterns, called closed (k, r)-flock patterns in trajectory databases. A (k, r)-flock pattern (Gudmundsson and van Kreveld, 2006) represents a set of moving objects traveling close each other within radius r during time period of length k. Based on the notion of the envelope for a flock pattern, we introduc...
متن کاملCoordinated Behaviour in Pigeon Flocks
We analysed pigeon flock flights using GPS trajectory data to reveal the most important kinematic aspects of flocking behaviour. We quantitatively investigated the internal motion of the flock based on pairwise statistics and found the following general relationships in all datasets: i) the temporal order of decisions characterised by the delay between directional changes is strictly related to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Control and Optimization
دوره 50 شماره
صفحات -
تاریخ انتشار 2012